Papers by Ramón Fernandez Astudillo
Confidence-Weighted Token Set Cover for Early Hypothesis Pruning in Self-Consistency (2026.findings-acl)
Copied to clipboard
| Challenge: | Despite its simplicity and efficacy, the high token expenditure of self-consistency can limit its practical utility. |
| Approach: | They propose a fast weighted set cover algorithm that utilizes two lightweight indicators to prune intermediate hypotheses periodically. |
| Outcome: | The proposed method reduces self-consistency token efficiency by 10-35% on three math benchmarks. |